Cyclicity in rank-1 perturbation problems
نویسندگان
چکیده
منابع مشابه
Cyclicity in Rank-one Perturbation Problems
The property of cyclicity of a linear operator, or equivalently the property of simplicity of its spectrum, is an important spectral characteristic that appears in many problems of functional analysis and applications to mathematical physics. In this paper we study cyclicity in the context of rank-one perturbation problems for self-adjoint and unitary operators. We show that for a fixed non-zer...
متن کاملSymmetry in Perturbation Problems
The work is devoted to a new branch of application of continuous group’s techniques in the investigation of nonlinear differential equations. The principal stages of the development of perturbation theory of nonlinear differential equations are considered in short. It is shown that its characteristic features make it possible a fruitful usage of continuous group’s techniques in problems of pert...
متن کاملEquivalence up to a Rank One Perturbation
This note is devoted to the spectral analysis of rank one perturbations of unitary and self-adjoint operators. We study the following question: given two cyclic (i.e., having simple spectrum) operators A and B, when is A equivalent to B up to a rank one perturbation? More precisely, when does there exist a unitary operator U such that rank (UAU∗−B) = 1? As usual, we are looking for an answer in...
متن کاملLow Rank Perturbation of Jordan Structure
Let A be a matrix and λ0 be one of its eigenvalues having g elementary Jordan blocks in the Jordan canonical form of A. We show that for most matrices B satisfying rank (B) ≤ g, the Jordan blocks of A+B with eigenvalue λ0 are just the g− rank (B) smallest Jordan blocks of A with eigenvalue λ0. The set of matrices for which this behavior does not happen is explicitly characterized through a scal...
متن کاملLimited memory Rank-1 Cuts for Vehicle Routing Problems
Pecin et al. (2016) introduced a “limited memory” technique that allows an efficient use of Rank-1 cuts in the Set Partitioning Formulation of Vehicle Routing Problems, motivating a deeper investigation of those cuts. This work presents a computational polyhedral study that determines the best possible sets of multipliers for cuts with up to 5 rows. Experiments with CVRP instances show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2013
ISSN: 0024-6107
DOI: 10.1112/jlms/jdt028